Comparison-based centrality measures

نویسندگان

چکیده

Abstract Recently, learning only from ordinal information of the type “item x is closer to item y than z ” has received increasing attention in machine community. Such triplet comparisons are particularly well suited for crowdsourced human intelligence tasks, which workers make statements about relative distances a items. In this paper, we systematically investigate comparison-based centrality measures on triplets and theoretically analyze their underlying Euclidean notion centrality. Two such already appear literature under opposing approaches, propose third measure, natural compromise between these two. We further discuss relation statistical depth functions, comprise desirable properties measures, conclude with experiments real synthetic datasets medoid estimation outlier detection.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of Centrality Measures for Graph-Based Keyphrase Extraction

In this paper, we present and compare various centrality measures for graphbased keyphrase extraction. Through experiments carried out on three standard datasets of different languages and domains, we show that simple degree centrality achieve results comparable to the widely used TextRank algorithm, and that closeness centrality obtains the best results on short documents.

متن کامل

Eigenvector-Based Centrality Measures for Temporal Networks

Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a princi...

متن کامل

Centrality Measures Based on Current Flow

We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improve...

متن کامل

Relative Centrality Measures

In this paper we present natural and compelling generalizations of four widely used centrality measures to local and global measures relative to subsets of nodes in a network. These new relative centrality measures can provide insight into network properties with respect to subsets. Definitions of these measures are given and various properties are investigated.

متن کامل

Centrality Measures in Networks

We show that although the prominent centrality measures in network analysis make use of different information about nodes’ positions, they all process that information in a very restrictive and identical way. They all spring from a common family that are characterized by the same axioms. In particular, they are all based on a additively separable and linear treatment of a statistic that capture...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of data science and analytics

سال: 2021

ISSN: ['2364-415X', '2364-4168']

DOI: https://doi.org/10.1007/s41060-021-00254-4